Strategic programming on graph rewriting systems
نویسندگان
چکیده
منابع مشابه
Strategic programming on graph rewriting systems
Rewriting [4] is a computation model used in computer science, algebra, logic and linguistics, amongst others. Its purpose is to transform syntactic objects (words, terms, programs, proofs, graphs, etc., which we will call generally expressions), by applying rewrite rules until a suitable simplied form is obtained. Given an expression and a set of rewrite rules, it is often the case that severa...
متن کاملVisual Programming with Graph Rewriting Systems
The multi-paradigm language PROGRES is the first rule-oriented visual language which has a well-defined type concept and supports programming with graph rewriting systems. To some extent, it has the flavor of a visual database programming language with powerful pattern matching and replacing facilities as well as backtracking capabilities. Until now, it was mainly used for specifying and rapid ...
متن کاملStrategic Port Graph Rewriting for Autonomic Computing
In this paper, we present a high-level formalism based on port graph rewriting, strategic rewriting, and rewriting calculus. We show that this formalism is suitable for modeling autonomic systems and we illustrate its expressivity for modeling properties of such systems using an example of a mail delivery system.
متن کاملA Biochemical Calculus Based on Strategic Graph Rewriting
Graphs are suitable for describing the structure of complex systems and graph transformations for modeling their dynamic evolution. We are interested in a particular representation of molecular complexes as graphs and of reaction patterns as graph transformations: • the behavior of a protein is given by its functional domains / sites on the surface • two proteins can interact by binding or chan...
متن کاملBlind graph rewriting systems
We consider a simple (probably, the simplest) structure for random access memory. This structure can be used to construct a universal system with nearly void processor, namely, we demonstrate that the processor of such a system may have empty instruction set, in a more strong manner than the existing ZISC (zero instruction set computer based on ideas for artificial neural networks) and NISC arc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2010
ISSN: 2075-2180
DOI: 10.4204/eptcs.44.1